Best Approximation and Saturation on Domains Bounded by Curves of Bounded Rotation
نویسندگان
چکیده
منابع مشابه
Bloch approximation in homogenization on bounded domains
The classical problem of homogenization deals with elliptic operators in periodically oscillating media of small period ε > 0 and the asymptotic behavior of solution u of boundary value problems associated with such operators. In a previous work [5], the authors introduced what is called Bloch approximation which provided energy norm approximation for the solution in R . This paper continues wi...
متن کاملBounded Holomorphic Functions on Bounded Symmetric Domains
Let D be a bounded homogeneous domain in C , and let A denote the open unit disk. If z e D and /: D —► A is holomorphic, then ß/(z) is defined as the maximum ratio \Vz(f)x\/Hz(x, 3c)1/2 , where x is a nonzero vector in C and Hz is the Bergman metric on D . The number ßf(z) represents the maximum dilation of / at z . The set consisting of all ß/(z), for z e D and /: D —► A holomorphic, is known ...
متن کاملNumerical approximation of stochastic conservation laws on bounded domains
This paper is devoted to the study of finite volume methods for the discretization of scalar conservation laws with a multiplicative stochastic force defined on a bounded domain D of R with Dirichlet boundary conditions and a given initial data in L(D). We introduce a notion of stochastic entropy process solution which generalizes the concept of weak entropy solution introduced by F.Otto for su...
متن کاملShearlets on Bounded Domains
Shearlet systems have so far been only considered as a means to analyze L2-functions defined on R2, which exhibit curvilinear singularities. However, in applications such as image processing or numerical solvers of partial differential equations the function to be analyzed or efficiently encoded is typically defined on a non-rectangular shaped bounded domain. Motivated by these applications, in...
متن کاملOn Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The results show a trade-off between the closeness of the approximation and the number of queries required. For an approximation factor k(n), log logk(n) n queries to an NP oracle can be used to approximate the maximum clique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1999
ISSN: 0021-9045
DOI: 10.1006/jath.1998.3335